Survivable Traffic Grooming Research Report CSC 791b: Survivable Networks

نویسندگان

  • Mohan Iyer
  • Shrikrishna Khare
چکیده

Recent advances in optical communications have increased the bandwidth of individual wavelengths and the number of wavelengths carried per fiber by a substantial amount. The increase in traffic demands has however failed to keep pace with this phenomenon resulting in a number of sub-wavelength demands. These sub-wavelength demands need to be allocated one wavelength resulting in wastage of residual wavelength capacity. Traffic grooming aims to aggregate these low capacity demands onto high capacity wavelengths aiming to improve the bandwidth utilization Survivable traffic grooming aims to provide reliable and resource efficient subwavelength-granularity connection services in optical networks. In this survey, we give an overview of the research done in survivable traffic grooming. We focus on the protections mechanisms for traffic grooming. We describe schemes for dynamic traffic like protection at lightpath (PAL) and protection at connection (PAC). We also describe some algorithms developed to address the static survivable traffic grooming problem under Shared Risk Link Groups constraints. We briefly mention abut another emerging research area, survivability in waveband switching.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Survivable Traffic Grooming in WDM Optical Networks

Traffic grooming, in which low-rate circuits are multiplexed onto wavelengths, with the goal of minimizing the number of add-drop multiplexers (ADMs) and wavelengths has received much research attention from the optical networking community in recent years. While previous work has considered various traffic models and network architectures, protection requirements of the circuits have not been ...

متن کامل

School of Computer Science Literature Review and Survey (0360-510, Fall 2006) Heuristics for Traffic Grooming in WDM Optical Networks with Shared Path Protection

The emergence of wavelength division multiplexing (WDM) technology has significantly increased the transmission capacity of a link in today's optical networks. In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity optical fibers to make an efficient use of the ban...

متن کامل

Availability-Guaranteed Service Provisioning Employing a Generalized Path-Protection Model in WDM Networks

Traffic grooming deals with efficiently packing/unpacking low-speed connections onto high-capacity trunks. We examine traffic grooming for optical mesh networks by reviewing grooming-node architectures, traffic models, grooming policies, novel graph models, survivable grooming, and hierarchical switching, etc. @2003 Optical Society of America OCIS codes: (060.4250) Networks; (060.4510) Optical ...

متن کامل

Enabling subwavelength level traffic grooming in survivable WDM optical network design

The explosion of data traffic and the availability of huge bandwidth using WDM optical network make it important to study optical layer networking restoration design. This paper addresses problem of enabling traffic grooming in mesh survivable WDM optical network design. Traffic grooming in optical network is defined as the act of multiplexing, demultiplexing and switching lower rate traffic on...

متن کامل

Traffic Grooming for Survivable WDM Networks – Dedicated Protection

This paper investigates the survivable traffic-grooming problem for optical mesh networks employing wavelength-division multiplexing (WDM) and dedicated protection. We consider the dynamic-provisioning environment where a connection arrives at random, holds for a random amount of time, and then departs. A typical connection request may require bandwidth less than that of a wavelength, and it ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007